A Kernel Classifier using Linearised Bregman Iteration
نویسنده
چکیده
In this paper we introduce a novel kernel classifier based on a iterative shrinkage algorithm developed for compressive sensing. We have adopted Bregman iteration with soft and hard shrinkage functions and generalized hinge loss for solving l1 norm minimization problem for classification. Our experimental results with face recognition and digit classification using SVM as the benchmark have shown that our method has a close error rate compared to SVM but do not perform better than SVM. We have found that the soft shrinkage method give more accuracy and in some situations more sparseness than hard shrinkage methods. Keywords—Compressive sensing, Bregman iteration, Generalised hinge loss, sparse, kernels, shrinkage functions
منابع مشابه
An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملLaplace Variational Iteration Method for Modified Fractional Derivatives with Non-singular Kernel
A universal approach by Laplace transform to the variational iteration method for fractional derivatives with the nonsingular kernel is presented; in particular, the Caputo-Fabrizio fractional derivative and the Atangana-Baleanu fractional derivative with the non-singular kernel is considered. The analysis elaborated for both non-singular kernel derivatives is shown the necessity of considering...
متن کاملBlind motion deblurring using multiple images
Recovery of degraded images due to motion blurring is one challenging problem in digital imaging. Most existing techniques on blind deblurring are not capable of removing complex motion blurring from the blurred images of complex structures. One promising approach is to recover the clear image using multiple images captured for the scene. However, it is observed in practice that such a multi-fr...
متن کاملEfficient karaoke song recommendation via multiple kernel learning approximation
Online karaoke allows users to practice singing and distribute recordings. Different from traditional music recommendation, online karaoke need to consider users’ vocal competence besides their tastes. In this paper, we develop a karaoke recommender system by taking into account vocal competence. Alone this line, we propose a joint modeling method named MKLA by adopting bregman divergence as th...
متن کاملConvergence of the linearized Bregman iteration for ℓ1-norm minimization
One of the key steps in compressed sensing is to solve the basis pursuit problem minu∈Rn{‖u‖1 : Au = f}. Bregman iteration was very successfully used to solve this problem in [40]. Also, a simple and fast iterative algorithm based on linearized Bregman iteration was proposed in [40], which is described in detail with numerical simulations in [35]. A convergence analysis of the smoothed version ...
متن کامل